Alleviating the Sparsity in Collaborative Filtering using Crowdsourcing
نویسندگان
چکیده
As a novel method for alleviating the sparsity problem in collaborative filtering (CF), we explore crowdsourcing-based CF, namely CrowdCF, which solicits new ratings from the crowd. We study three key questions that need to be addressed to effectively utilize CrowdCF: (1) how to select items to show for crowd workers to elicit extra ratings, (2) how to decide the minimum quantity asked to the crowd, and (3) how to handle the erroneous ratings. We validate the effectiveness of CrowdCF by conducting offline experiments using real-life datasets and online experiments on Amazon Mechanical Turk. The best configuration of CrowdCF improves system-wide MAE by 0.07 and 0.03, and F1-score by 4% and 2% in offline and online experiments, compared to the state-of-the-art CF algorithm.
منابع مشابه
A NOVEL FUZZY-BASED SIMILARITY MEASURE FOR COLLABORATIVE FILTERING TO ALLEVIATE THE SPARSITY PROBLEM
Memory-based collaborative filtering is the most popular approach to build recommender systems. Despite its success in many applications, it still suffers from several major limitations, including data sparsity. Sparse data affect the quality of the user similarity measurement and consequently the quality of the recommender system. In this paper, we propose a novel user similarity measure based...
متن کاملیک سامانه توصیهگر ترکیبی با استفاده از اعتماد و خوشهبندی دوجهته بهمنظور افزایش کارایی پالایشگروهی
In the present era, the amount of information grows exponentially. So, finding the required information among the mass of information has become a major challenge. The success of e-commerce systems and online business transactions depend greatly on the effective design of products recommender mechanism. Providing high quality recommendations is important for e-commerce systems to assist users i...
متن کاملAlleviating the Sparsity Problem of Collaborative Filtering Using Trust Inferences
Collaborative Filtering (CF), the prevalent recommendation approach, has been successfully used to identify users that can be characterized as “similar” according to their logged history of prior transactions. However, the applicability of CF is limited due to the sparsity problem, which refers to a situation that transactional data are lacking or are insufficient. In an attempt to provide high...
متن کاملAlleviating the Sparsity Problem in Collaborative Filtering by Using an Adapted Distance and a Graph-Based Method
Collaborative filtering (CF) is the process of predicting a user’s interest in various items, such as books or movies, based on taste information, typically expressed in the form of item ratings, from many other users. One of the key issues in collaborative filtering is how to deal with data sparsity; most users rate only a small number of items. This paper’s first contribution is a distance me...
متن کاملTransfer Learning in Collaborative Filtering for Sparsity Reduction
Data sparsity is a major problem for collaborative filtering (CF) techniques in recommender systems, especially for new users and items. We observe that, while our target data are sparse for CF systems, related and relatively dense auxiliary data may already exist in some other more mature application domains. In this paper, we address the data sparsity problem in a target domain by transferrin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013